Top-k Multiclass SVM
نویسندگان
چکیده
Class ambiguity is typical in image classification problems with a large number of classes. When classes are difficult to discriminate, it makes sense to allow k guesses and evaluate classifiers based on the top-k error instead of the standard zero-one loss. We propose top-k multiclass SVM as a direct method to optimize for top-k performance. Our generalization of the well-known multiclass SVM is based on a tight convex upper bound of the top-k error. We propose a fast optimization scheme based on an efficient projection onto the top-k simplex, which is of its own interest. Experiments on five datasets show consistent improvements in top-k accuracy compared to various baselines.
منابع مشابه
Analysis and Optimization of Loss Functions for Multiclass, Top-k, and Multilabel Classification
Top-k error is currently a popular performance measure on large scale image classification benchmarks such as ImageNet and Places. Despite its wide acceptance, our understanding of this metric is limited as most of the previous research is focused on its special case, the top-1 error. In this work, we explore two directions that shed light on the top-k error. First, we provide an in-depth analy...
متن کاملA prototype classification method and its use in a hybrid solution for multiclass pattern recognition
In order to combine a fast multiclass classification method with an effective binary classification method, we have developed a prototype learning/matching scheme that can be integrated with support vector machines (SVM) for vector-matching applications. This prototype classification method employs a learning process to determine both the number and the location of prototypes. The learning proc...
متن کاملMulticategory Classification by Support Vector Machines
We examine the problem of how to discriminate between objects of three or more classes. Specifically, we investigate how two-class discrimination methods can be extended to the multiclass case. We show how the linear programming (LP) approaches based on the work of Mangasarian and quadratic programming (QP) approaches based on Vapnik’s Support Vector Machines (SVM) can be combined to yield two ...
متن کاملA Multiclass Classification of Cancer Data: Using a Kernel Based Clustering k-NN Support Vector Machine
Support vector machines (SVM) have been promising methods for classification because of their solid mathematical foundations which convey several salient properties that other methods hardly provide. However, despite of the prominent properties of SVM, they are not as favored for large-scale data as complexity of SVM is highly dependent on the size of a data set. Microarray gene expression data...
متن کاملUniversum Learning for Multiclass SVM
We introduce Universum learning [1], [2] for multiclass problems and propose a novel formulation for multiclass universum SVM (MU-SVM). We also propose a span bound for MU-SVM that can be used for model selection thereby avoiding resampling. Empirical results demonstrate the effectiveness of MU-SVM and the proposed bound.
متن کامل